6. Conclusion

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

6 Conclusion

We have shown, how a schedulability analysis, including a codesign approach for periodic tasks, can be extended for the analysis of sporadic tasks and dependencies between tasks, what often occurs in SDL/MSC specified systems. To allow this we extended the classical task model with starting points for each task. To calculate the response times of sporadic tasks we consider instances of tasks. T...

متن کامل

6. Conclusion

A reliable multicast protocol enables a process to multicast a message to a group of processes in a way that ensures that all honest destination-group members receive the same message, even if some group members and the multicast initiatorare maliciously faulty. Reliable multicast has been shown to be useful for building multiparty cryptographic protocols and secure distributed services. We pre...

متن کامل

6. Conclusion

16 disjoint. It overcomes the hypothesis of existence of a precise final goal in goal-regression systems. Motivations have been shown to be useful in guiding the behavior of a mobile robot in variously configured indoor environments. Experimental results provide evidence that correlation does exist between motivational profile and environment, in order to get optimal performances of the agent. ...

متن کامل

6. Conclusion

As already mentioned, the key distribution can be made simple and effective with smart cards which also contain the DES algorithm. The cards are customised by the operator and sent to each individual subscriber. The key stored in the card is uniquely related to the subscribers logical directory number, which again is uniquely related to the physical line. A smart card can thus only be used by t...

متن کامل

6. Conclusion 5. Route Planning

and the destination points are in different maps. For instance, bus-stop T3 can be reached from C1 by highway line H2 (or H1) to C3 and then by bus trip R1: S 22 (C1H2) ∧ S 34 (C3H2) ∧ T 22 (C3R1) ∧ T 23 (T3R1). Additional types of connections can be defined to express situations involving routes from a station to another. In procedural terms the previous definitions reduce to a search for inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nihon Naika Gakkai Zasshi

سال: 2019

ISSN: 0021-5384,1883-2083

DOI: 10.2169/naika.108.443